A Relational Account of Call-by-Value Sequentiality
نویسندگان
چکیده
We construct a model for FPC, a purely functional, sequential, call-by-value language. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. We prove that the model is fully abstract.
منابع مشابه
A Semantical and Operational Account of Call-by-Value Solvability
In Plotkin’s call-by-value lambda-calculus, solvable terms are characterized syntactically by means of call-by-name reductions and there is no neat semantical characterization of such terms. Preserving confluence, we extend Plotkin’s original reduction without adding extra syntactical constructors, and we get a call-by-value operational characterization of solvable terms. Moreover, we give a se...
متن کاملA Refinement of Strong Sequentiality for Term Rewriting with Constructors
The notion of call-by-need evaluation has turned out to be very fruitful when applied to dialects of the i-calculus (Henderson and Morris, 1976, in “Proc. 3rd ACM Symp. on the Principles of Programming Languages, Atlanta; Kahn and Mac Queen, 1977, in “IFIP 77,” North-Holland, Amsterdam; Turner, 1979, Software Practice and Experience, Vol. 9; Vuillemin, 1974, J. Cornput. System3 .Sci. 9, 332-354...
متن کاملComputational Model for Automatic Chord Voicing Based on Bayesian Network
We developed a computational model for automatically voicing chords based on a Bayesian network. Automatic chord voicing is difficult because it is necessary to choose extended notes and inversions by taking into account musical simultaneity and sequentiality. We overcome this difficulty by inferring the most likely chord voicing using a Bayesian network model where musical simultaneity and seq...
متن کاملApplication of Monte Carlo Simulation in the Assessment of European Call Options
In this paper, the pricing of a European call option on the underlying asset is performed by using a Monte Carlo method, one of the powerful simulation methods, where the price development of the asset is simulated and value of the claim is computed in terms of an expected value. The proposed approach, applied in Monte Carlo simulation, is based on the Black-Scholes equation which generally def...
متن کاملDecidable Call by Need Computations in term Rewriting (Extended Abstract)
In this paper we study decidable approximations to call by need computations to normal and root-stable forms in term rewriting. We obtain uniform decidability proofs by making use of elementary tree automata techniques. Surprisingly, by avoiding complicated concepts like index and sequentiality we are able to cover much larger classes of term rewriting systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 179 شماره
صفحات -
تاریخ انتشار 1997